Coding Parking Functions by Pairs of Permutations
نویسندگان
چکیده
We introduce a new class of admissible pairs of triangular sequences and prove a bijection between the set of admissible pairs of triangular sequences of length n and the set of parking functions of length n. For all u and v = 0, 1, 2, 3 and all n ≤ 7 we describe in terms of admissible pairs the dimensions of the bi-graded components hu,v of diagonal harmonics C[x1, . . . , xn; y1, . . . , yn]/Sn, i.e., polynomials in two groups of n variables modulo the diagonal action of symmetric group Sn.
منابع مشابه
Generalized Parking Functions, Descent Numbers, and Chain Polytopes of Ribbon Posets
We consider the inversion enumerator In(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = −1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula In(−1) = En, the number of alternating perm...
متن کاملTransitive cycle factorizations and prime parking functions
Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1, n − 1) and prime parking functions of length n.
متن کاملFree Quasi-symmetric Functions of Arbitrary Level
We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products Γ ≀ Sn and the corresponding generalizations of quasi-symmetric functions. Finally, we obtain Hopf algebras of colored parking functions, colored non-crossing partitions and park...
متن کاملParking Functions, Stack-Sortable Permutations, and Spaces of Paths in the Johnson Graph
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation, and we show how this relates to parameterizing certain spaces of paths in the Johnson graph.
متن کاملRefined Enumeration of Minimal Transitive Factorizations of Permutations
Minimal transitive cycle factorizations, parking functions and labeled trees are related very closely. Using the correspondences between them, we find a refined enumeration of minimal transitive factorizations of permutations of type (1, n− 1) and (2, n− 2).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003